package com.example.leetdemo.process;

import java.util.HashMap;
import java.util.Map;

public class Solution1345 {

    public int minJumps(int[] arr) {
        int[] temp = new int[arr.length];
        Map<Integer, int[]> map = new HashMap<>();
        for (int i = 0; i < arr.length; i++) {
            temp[i] = i;
            if (map.containsKey(arr[i])) {
                map.put(arr[i], new int[] {i});
            } else {
                int[] ints = map.get(arr[i]);
            }
        }
        return 0;
    }

}
